The set of all non-increasing non-negative integer sequences p= (d1, d2,…, dn) is denoted by NSn. A sequence pÎNSn is said to be graphic if it is the degree sequence of a simple graph G on nvertices, and such a graph G is called a realization of p The set of all graphic sequences in NSn is denoted by GSn. The complete product split graph on L+M vertices is denoted by `SL, M=KL Ú`KM, where KL and KM are complete graphs respectively on L=Σp i=1 ri and M=Σp i=1 si vertices with ri andsi being integers. Another split graph is denoted by SL, M=`Sr 1, s 1 Ú`Sr2, s 2 Ú…Ú`Srp, sp= (Kr1ÚKs1) _ (Kr2 Ú Ks2) Ú…Ú (Krp Ú Ksp). A sequence p= (d 1, d 2,… , dn) is said to be po-tentially SL, M -graphic (respectively SL, M) -graphic if there is a realization G of p containing `SL, M (respectively `SL, M) as a subgraph. If p has a realization G containing `SL, M on those vertices having degrees d1, d2,… , dL+M, then p is potentially AL, M -graphic. A non-increasing sequence of non-negative integersp= (d1, d2,…, dn) is potentially AL, M -graphic if and only if it is potentially SL, M -graphic. In this paper, we obtain the sufficient condition for a graphic sequence to be potentially AL, M -graphic and this result is a generalization of that given by J. H. Yin on split graphs.